On the Dual Form of “low M∗-estimate” in the Quasi-convex Case
نویسنده
چکیده
Let B 2 denote the Euclidean ball in IR , and, given closed star-shaped body K ⊂ IR, MK denote the average of the gauge of K on the Euclidean sphere. Let p ∈ (0, 1) and let K ⊂ IR be a p-convex body. In [17] we proved that for every λ ∈ (0, 1) there exists an orthogonal projection P of rank (1− λ)n such that f(λ) MK PB 2 ⊂ PK, where f(λ) = cpλ for some positive constant cp depending on p only. In this note we prove that f(λ) can be taken equal to Cpλ. In terms of Kolmogorov numbers it means that for every k ≤ n dk(Id : `2 −→ (IR, ‖ · ‖K)) ≤ Cp n1/p−1 k1/p−1/2 `(Id : `2 −→ (IR, ‖ · ‖K)), where `(Id) = E‖ ∑n i=1 giei‖K for the independent standard Gaussian random variables {gi} and the canonical basis {ei} of IR. All results do not require the symmetry of K.
منابع مشابه
Non-homogeneous continuous and discrete gradient systems: the quasi-convex case
In this paper, first we study the weak and strong convergence of solutions to the following first order nonhomogeneous gradient system $$begin{cases}-x'(t)=nablaphi(x(t))+f(t), text{a.e. on} (0,infty)\x(0)=x_0in Hend{cases}$$ to a critical point of $phi$, where $phi$ is a $C^1$ quasi-convex function on a real Hilbert space $H$ with ${rm Argmin}phineqvarnothing$ and $fin L^1(0...
متن کاملAn Interior Point Algorithm for Solving Convex Quadratic Semidefinite Optimization Problems Using a New Kernel Function
In this paper, we consider convex quadratic semidefinite optimization problems and provide a primal-dual Interior Point Method (IPM) based on a new kernel function with a trigonometric barrier term. Iteration complexity of the algorithm is analyzed using some easy to check and mild conditions. Although our proposed kernel function is neither a Self-Regular (SR) fun...
متن کاملCoincidence Quasi-Best Proximity Points for Quasi-Cyclic-Noncyclic Mappings in Convex Metric Spaces
We introduce the notion of quasi-cyclic-noncyclic pair and its relevant new notion of coincidence quasi-best proximity points in a convex metric space. In this way we generalize the notion of coincidence-best proximity point already introduced by M. Gabeleh et al cite{Gabeleh}. It turns out that under some circumstances this new class of mappings contains the class of cyclic-noncyclic mappings ...
متن کاملOn the dual of certain locally convex function spaces
In this paper, we first introduce some function spaces, with certain locally convex topologies, closely related to the space of real-valued continuous functions on $X$, where $X$ is a $C$-distinguished topological space. Then, we show that their dual spaces can be identified in a natural way with certain spaces of Radon measures.
متن کاملSpeech Enhancement by Modified Convex Combination of Fractional Adaptive Filtering
This paper presents new adaptive filtering techniques used in speech enhancement system. Adaptive filtering schemes are subjected to different trade-offs regarding their steady-state misadjustment, speed of convergence, and tracking performance. Fractional Least-Mean-Square (FLMS) is a new adaptive algorithm which has better performance than the conventional LMS algorithm. Normalization of LMS ...
متن کاملThe covering numbers and “ low M ∗ - estimate ” for quasi - convex bodies . ∗
This article gives estimates on the covering numbers and diameters of random proportional sections and projections of quasi-convex bodies in R. These results were known for the convex case and played an essential role in the development of the theory. Because duality relations cannot be applied in the quasi-convex setting, new ingredients were introduced that give new understanding for the conv...
متن کامل